Lightweight modular staging
نویسندگان
چکیده
منابع مشابه
Lightweight modular orthosis.
Background and highlights are presented concerning the development of a new orthotic system judged to be "the most outstanding innovation in prosthetics and/or orthotics practice" during the 1986-1989 period. The first Brian Blatchford Prize was awarded at the Sixth World Congress of ISPO held in Kobe, Japan. November 12-17, 1989. The new development selected as most deserving of this award con...
متن کاملLightweight Modular Staging and Embedded Compilers: Abstraction without Regret for High-Level High-Performance Programming
Programs expressed in a high-level programming language need to be translated to a low-level machine dialect for execution. This translation is usually accomplished by a compiler, which is able to translate any legal program to equivalent low-level code. But for individual source programs, automatic translation does not always deliver good results: Software engineering practice demands generali...
متن کاملRoboFrame - A Modular Software Framework for Lightweight Autonomous Robots
The complexity of autonomous robot systems has increased dramatically in recent years. Besides an increased variety of robots, sensors, actuators, onboard computers and intelligent algorithms, the architecture of the software has gained crucial relevance with respect to the efficiency for adopting a robotic system to new hardware, new software or new tasks. For evaluation of different robot arc...
متن کاملModular Workflow Engine for Distributed Services using Lightweight Java Clients
Abstract—In this article we introduce the concept and the first implementation of a lightweight client-server-framework as middleware for distributed computing. On the client side an installation without administrative rights or privileged ports can turn any computer into a worker node. Only a Java runtime environment and the JAR files comprising the workflow client are needed. To connect all c...
متن کاملModular and lightweight certification of polyhedral abstract domains ∗
interpretation [5] provides a theory for static analysis of programs, where sets of reachable states are over-approximated by elements of an abstract domain. In particular, the domain of convex polyhedra [6] expresses postconditions as conjunctions of affine inequalities: a polyhedron p encodes a formula “ ∧ i ∑ j aij .xj≤bi”, where aij and bi are rational constants, and xj are numerical variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2012
ISSN: 0001-0782,1557-7317
DOI: 10.1145/2184319.2184345